Check if the Numeric value is a Prime number [Brute Force]

def is_prime(num):
   ''' Check if the numeric value is a prime number.
       :param num: numeric value (int, > 0)
       :return: True if num is prime number,
                False, otherwise (complex)
   '''
   if num <= 3:
       return True
   devisor = 2
   while devisor < num:
       if num % devisor == 0:
           return False
       else:
           devisor += 1
   return True

Test

def test_sort(algorithm):

   print("Testing:", algorithm.__doc__)

   print("testcase #1: ", end="")
   N = 14
   B_prime = False
   Res = algorithm(N)
   print("Ok" if Res == B_prime else "Fail")

   print("testcase #2: ", end="")
   N = 19
   B_prime = True
   Res = algorithm(N)
   print("Ok" if Res == B_prime else "Fail")

   print("testcase #3: ", end="")
   N = 1087
   B_prime = True
   Res = algorithm(N)
   print("Ok" if Res == B_prime else "Fail")

if __name__ == "__main__":
   test_sort(is_prime)